Low-rank Approximation and Dynamic Mode Decomposition
نویسندگان
چکیده
Dynamic Mode Decomposition (DMD) has emerged as a powerful tool for analyzing the dynamics of non-linear systems from experimental datasets. Recently, several attempts have extended DMD to the context of low-rank approximations. This low-rank extension takes the form of a nonconvex optimisation problem. To the best of our knowledge, only sub-optimal algorithms have been proposed in the literature to compute the solution of this problem. In this paper, we prove that there exists a closed-form optimal solution to this problem and design an effective algorithm to compute it based on Singular Value Decomposition (SVD). Based on this solution, we then propose efficient procedures for reduced-order modeling and for the identification of the low-rank DMD modes and amplitudes. Experiments illustrates the gain in performance of the proposed algorithm compared to state-of-the-art techniques.
منابع مشابه
Randomized Dynamic Mode Decomposition
This paper presents a randomized algorithm for computing the near-optimal low-rank dynamic mode decomposition (DMD). Randomized algorithms are emerging techniques to compute low-rank matrix approximations. They are able to ease the computational challenges arising in the area of ‘big data’. The idea is to derive from the high-dimensional input matrix a smaller matrix, which is then used to effi...
متن کاملDynamic Mode Decomposition for Real-Time Background/Foreground Separation in Video
This paper introduces the method of dynamic mode decomposition (DMD) for robustly separating video frames into background (low-rank) and foreground (sparse) components in real-time. The method is a novel application of a technique used for characterizing nonlinear dynamical systems in an equation-free manner by decomposing the state of the system into low-rank terms whose Fourier components in ...
متن کاملOptimal mode decomposition for unsteady flows
A new method, herein referred to as Optimal Mode Decomposition (OMD), of finding a linear model to describe the evolution of a fluid flow is presented. The method estimates the linear dynamics of a high-dimensional system which is first projected onto a subspace of a user-defined fixed rank. An iterative procedure is used to find the optimal combination of linear model and subspace that minimis...
متن کاملThe Singular Value Decomposition and Low Rank Approximation
The purpose of this paper is to present a largely self-contained proof of the singular value decomposition (SVD), and to explore its application to the low rank approximation problem. We begin by proving background concepts used throughout the paper. We then develop the SVD by way of the polar decomposition. Finally, we show that the SVD can be used to achieve the best low rank approximation of...
متن کاملLiterature survey on low rank approximation of matrices
Low rank approximation of matrices has been well studied in literature. Singular value decomposition , QR decomposition with column pivoting, rank revealing QR factorization (RRQR), Interpolative decomposition etc are classical deterministic algorithms for low rank approximation. But these techniques are very expensive (O(n 3) operations are required for n × n matrices). There are several rando...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1610.02962 شماره
صفحات -
تاریخ انتشار 2016